Minimum Length Scheduling for Discrete-Rate Full-Duplex Wireless Powered Communication Networks

Wireless powered communication networks (WPCNs) will act as a major enabler of massive machine type communications (MTCs), which is service domain for 5G and beyond systems. The MTC be deployed by using low-power transceivers with finite discrete configurations. This paper considers minimum length scheduling problem full-duplex WPCNs, where users transmit information to hybrid access point at rate chosen from set discrete-rate levels. optimization energy causality, data maximum power constraints, proven NP-hard. As solution strategy, we define the (MLS) slot, slot transmission completion time while starting anytime after decision time. We solve optimally given order based on optimality analysis MLS slot. For general problem, categorize whether slots overlap over propose optimal algorithm non-overlapping scenario allocating slots, polynomial-time heuristic overlapping user earliest Through simulations, demonstrate significant gains allocation.